A variant on the compressed sensing of Emmanuel Candès Basarab Matei and Yves Meyer
نویسندگان
چکیده
This paper is motivated by the outsanding achievements of Emmanuel Candès and Terence Tao on what is now called “compressed sensing”. Let us begin with a theorem by Terence Tao. Let p be a prime number and Fp be the finite field with p elements. We denote by #E the cardinality of E ⊂ Fp. The Fourier transform of a complex valued function f defined on Fp is denoted by f̂ . Let Mq be the collection of all f : Fp 7→ C such that the cardinality of the support of f does not exceed q. Then Terence Tao proved that for q < p/2 and for any set Ω of frequencies such that #Ω ≥ 2q, the mapping Φ : Mq 7→ l(Ω) defined by f 7→ f̂ is injective. We want to generalize this fact to functions defined on the unit square with applications to image processing. In a forthcoming work the hypothesis that f is supported by the unit square will be removed. Here and in what follows the action takes place on [0, 1] identified to (R/Z). Since the unit square [0, 1] has been identified to (R/Z), the Fourier transform of f ∈ L([0, 1]) is the
منابع مشابه
The restricted isometry property and its implications for compressed sensing
It is now well-known that one can reconstruct sparse or compressible signals accurately from a very limited number of measurements, possibly contaminated with noise. This technique known as “compressed sensing” or “compressive sampling” relies on properties of the sensing matrix such as the restricted isometry property. In this Note, we establish new results about the accuracy of the reconstruc...
متن کاملMathematics of sparsity ( and a few other things )
In the last decade, there has been considerable interest in understanding when it is possible to find structured solutions to underdetermined systems of linear equations. This paper surveys some of the mathematical theories, known as compressive sensing and matrix completion, that have been developed to find sparse and low-rank solutions via convex programming techniques. Our exposition emphasi...
متن کاملStable Sampling and Fourier Multipliers
We study the relationship between stable sampling sequences for bandlimited functions in Lp(Rn) and the Fourier multipliers in Lp. In the case that the sequence is a lattice and the spectrum is a fundamental domain for the lattice the connection is complete. In the case of irregular sequences there is still a partial relationship. 2010 Mathematics Subject Classification: 42A45, 42B15, 42C15, 62...
متن کاملTwo Algorithms on Matrix Completion and Compressed Sensing
Compressed Sensing and Matrix Completion, two fields existing for decades, recently led by Emmanuel Candès, Terrence Tao and David L. Donoho, are becoming one of the most active researching areas in computational harmonic analysis. The fundamental principle of Compressed Sensing is that, through optimization, the sparsity of f ∈ RN , with N ∈ N an unknown but supposed to be compressible signal,...
متن کاملCurvelets and Fourier Integral Operators
A recent body of work introduced new tight-frames of curvelets [3, 4] to address key problems in approximation theory and image processing. This paper shows that curvelets essentially provide optimally sparse representations of Fourier Integral Operators. Dedicated to Yves Meyer on the occasion of his 65th birthday.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008